EXPLICIT UPPER BOUNDS FOR THE AVERAGE ORDER OF dn(m) AND APPLICATION TO CLASS NUMBER
نویسندگان
چکیده
In this paper, we prove some explicit upper bounds for the average order of the generalized divisor function, and, according to an idea of Lenstra, we use them to obtain bounds for the class number of number fields.
منابع مشابه
Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks
We introduce a new method for proving explicit upper bounds on the VC Dimension of general functional basis networks, and prove as an application, for the rst time, that the VC Dimension of analog neural networks with the sigmoidal activation function (y) = 1=1+e ?y is bounded by a quadratic polynomial O((lm) 2) in both the number l of programmable parameters, and the number m of nodes. The pro...
متن کاملVC Dimension of Sigmoidal and General Pfaffian Networks
We introduce a new method for proving explicit upper bounds on the VC Dimension of general functional basis networks, and prove as an application, for the rst time, that the VC Dimension of analog neural networks with the sigmoidal activation function (y) = 1=1+e ?y is bounded by a quadratic polynomial O((lm) 2) in both the number l of programmable parameters, and the number m of nodes. The pro...
متن کاملOn bounds for solutions of monotonic first order difference-differential systems
Many special functions are solutions of first order linear systems y′ n(x) = an(x)yn(x) + dn(x)yn−1(x), y ′ n−1(x), = bn(x)yn−1(x) + en(x)yn(x) . We obtain bounds for the ratios yn(x)/yn-1(x) and the logarithmic derivatives of yn(x) for solutions of monotonic systems satisfying certain initial conditions. For the case dn(x)en(x) > 0, sequences of upper and lower bounds can be obtained by iterat...
متن کاملBounds on the number of generalized partitions and some applications
We present bounds concerning the number of Hartmanis partitions of a finite set. An application of these inequalities improves the known asymptotic lower bound on the number of linear spaces on n points. We also present an upper bound for a certain class of these partitions which bounds the number of Steiner triple and quadruple systems. Recent work has extended the known numerical values for t...
متن کاملSWITCHING TEAMS ALGORITHM FOR SIZING OPTIMIZATION OF TRUSS STRUCTURES
Meta-heuristics have received increasing attention in recent years. The present article introduces a novel method in such a class that distinguishes a number of artificial search agents called players within two teams. At each iteration, the active player concerns some other players in both teams to construct its special movements and to get more score. At the end of some iterations (like quart...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002